Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis
نویسندگان
چکیده
We show that a practical translation of MRS descriptions into normal dominance constraints is feasible. We start from a recent theoretical translation and verify its assumptions on the outputs of the English Resource Grammar (ERG) on the Redwoods corpus. The main assumption of the translation— that all relevant underspecified descriptions are nets—is validated for a large majority of cases; all non-nets computed by the ERG seem to be systematically incomplete.
منابع مشابه
Bridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints
Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures, by translation into normal dominance constraints.
متن کاملMinimal Recursion Semantics as Dominance Constraints: Graph-Theoretic Foundation and Application to Grammar Engineering
This thesis defines a translation fromMinimal Recursion Semantics into dominance constraints, two relevant and closely related scope underspecification formalisms. Due to fundamental differences in the way the two formalisms interpret underspecified descriptions, the translation is restricted to a large class of underspecified descriptions that share certain structural properties. On the one ha...
متن کاملBridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints
Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.
متن کاملBridging the Gap Between Underspecification Formalisms: Minimal Recursion Semantics as Dominance Constraints
Minimal Recursion Semantics (MRS) is the standard formalism used in large-scale HPSG grammars to model underspecified semantics. We present the first provably efficient algorithm to enumerate the readings of MRS structures. It is obtained by translating MRS into normal dominance constraints for which efficient algorithms exist.
متن کاملSemantic Underspecification : Which Technique for What
In recent years a variety of representation formalisms have been proposed that support the construction of underspecified semantic representations, such as Quasi-Logical Form, Underspecified Logical Form, Underspecified Discourse Representation Theory, Minimal Recursion Semantics, Ontological Promiscuity, Hole Semantics, the Constraint Language for Lambda Structures, and Normal Dominance Constr...
متن کامل